DVispatch: A Visual Language with Distributed Rewriting

نویسندگان

  • Kenji Miyamoto
  • Yasunori Harada
چکیده

Our figure-rewriting visual language is extended by a general method so that it rewrites figures distributed on multiple hosts. With this language, network applications or distributed systems can be built simply by drawing figures as a graphical code on a single host. At run-time, the code is partitioned according to the number of target hosts and distributed on them. The partitioned codes then start running distributively and asynchronously, so as to simulate, as a whole, the behavior of the code in the original single-host language. Conversely speaking, a programmer can design and test the distributed behavior of the program by working on the code on a single host. With rewriting rules reflecting the locality of operations, describing distributed systems in such a visual geometrical language makes it easy to grasp the topological structure of their algorithm. Furthermore, geometrical coding of distributed resources enables finergrained control of resources than the conventional models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design, Construction, and Application of a Generic Visual Language Generation Environment

ÐThe implementation of visual programming languages (VPLs) and their supporting environments is time consuming and tedious. To ease the task, researchers have developed some high level tools to reduce the development effort. None of these tools, however, can be easily used to create a complete visual language in a seamless way like the lex/yacc tools for textual language constructions. This pap...

متن کامل

Communication Issues regarding Parallel Functional Graph Rewriting

Efficient communication is the basis of an implementation of a parallel language on a distributed machine architecture. This article handles about the communication mechanism that is needed to support parallel graph rewriting in Concurrent Clean. The danger of deadlock is imminent at several levels of such a system. Communication problems and their solutions are closely related to memory manage...

متن کامل

Term Graph Rewriting as a Specification and Implementation Framework for Concurrent Object-Oriented Programming Languages

The usefulness of the generalised computational model of Term Graph Rewriting Systems (TGRS) for designing and implementing concurrent object-oriented languages, and also for specifying and reasoning about the interaction between concurrency and object-orientation (such as concurrent synchronisation of methods or interference problems between concurrency and inheritance), is examined in this pa...

متن کامل

Visual Modelling and Validation of Distributed Systems

Distributed system technologies are fast developing and the complexity of networked systems increases. For this reason the precise design of distributed systems is necessary, comprising all key aspects. The employment of formal methods is restricted to few aspects such as performance and correctness of distributed algorithms, while the investigation of consistency issues, as they arise e.g. whe...

متن کامل

Deriving Software Performance Models from Architectural Patterns by Graph Transformations

The paper proposes a formal approach to building software performance models for distributed and/or concurrent software systems from a description of the system’s architecture by using graph transformations. The performance model is based on the Layered Queueing Network (LQN) formalism, which is an extension of the well-known Queueing Network modelling technique. The transformation from the arc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998